package graph;

import java.util.Iterator;

import set.Set;


public class Tree<T> {
	private class Node<P>{
		protected T elem;
		protected Set<Node<P>> sons;
	}
	
	private Node<T> root;

	public Tree(){
		
	}
	
	public boolean add(T elem){
		return false;	
	}
	
	public boolean remove(T elem){
		return false;		
	}
	
	public Set<Node<T>> leafs(){
		return null;
	}
	
	public Node<T> getRoot(){
		return root;
	}
	
	public Iterator<T> deepFirtSearch(){
		return null;	
	}
	
	public Iterator<T> branchFirtSearch(){
		return null;	
	}
	
	public Iterator<T> bestFirtSearch(Evaluetor<T> value){
		return null;	
	}
	
	public T[] toArray(){
		return null;
	}
	
	public String toString(){
		return null;
	}
}
